Complexity of near-optimal robust versions of multilevel optimization problems

Abstract Near-optimality robustness extends multilevel optimization with a limited deviation of lower level from its optimal solution, anticipated by higher levels. We analyze the complexity near-optimal robust problems, where is modelled through additional adversarial decision-makers. Near-optimal versions problems are shown to remain in same class as problem without near-optimality under general conditions.